How to model legal reasoning using dynamic logic programming: a preliminary report
نویسندگان
چکیده
Dynamic logic programming allows the representation and the inference of evolving knowledge. Legal knowledge reasoning needs the capability to model laws that change over time and to model laws produced by distinct entities with different priorities at different time points. In this paper we propose the use of dynamic logic programming to model these legal dynamic situations. Some examples are discussed and the implementation of a legal oracle server is described.
منابع مشابه
Using dynamic logic programming to model legal reasoning
Dynamic logic programming allows the representation and the inference of evolving knowledge. Legal knowledge reasoning needs the capability to model laws that change over time and to model laws produced by distinct entities with different priorities at different time points. In this paper we propose the use of dynamic logic programming to model these legal dynamic situations. Some examples are ...
متن کاملTranslating Case-Based Reasoning into Abductive Logic Programming
This paper presents a translation method of casebased reasoning which changes similarity according to context into abductive logic programming based on a generalized stable model semantics [5]. This kind of dynamic similarity can be found in CBR systems for legal reasoning such as HYPO [1]. Abductive logic programming is suitable to implement this dynamic similarity by regarding abducible predi...
متن کاملTowards Implementing Finite Model Reasoning in Description Logics
We describe our ongoing work that aims at understanding how one can develop a system that performs finite model reasoning in Description Logics. In particular we report on the preliminary results that we have obtained by encoding reasoning services in DLs as specifications for constraint programming solvers. We have used such an approach to reason with respect to finite models on UML class diag...
متن کاملInteractive Answer Set Programming - Preliminary Report
Traditional Answer Set Programming (ASP) rests upon one-shot solving. A logic program is fed into an ASP system and its stable models are computed. The high practical relevance of dynamic applications led to the development of multi-shot solving systems. An operative system solves continuously changing logic programs. Although this was primarily aiming at dynamic applications in assisted living...
متن کاملUsing Defeasible Logic Programming for Argumentation-Based Decision Support in Private Law
Legal reasoning is one of the most obvious application areas for computational models of argumentation as the exchange of arguments and counterarguments is the established means for making decisions in law. In this paper we employ Defeasible Logic Programming (DeLP) for representing legal cases and for giving decision-support, exemplary for private law. We give a formalization of legal provisio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003